Compact Linear Operators and Krylov Subspace Methods
نویسنده
چکیده
This thesis deals with linear ill-posed problems related to compact operators, and iterative Krylov subspace methods for solving discretized versions of these. Linear compact operators in infinite dimensional Hilbert spaces will be investigated and several results on the singular values and eigenvalues for such will be presented. A large subset of linear compact operators consists of integral operators and many results will be based on the kernel of such operators. Finite dimensional approximations to these operators will be considered by using Galerkin discretization. Several results will be shown stating how singular values and eigenvalues (and corresponding vectors) of infinite dimensional operators and their finite dimensional approximations are related. Krylov subspace methods, with focus on GMRES, will be investigated in relation to discrete ill-posed problems, that is, linear finite dimensional systems of equations that originate from ill-posed problems. By using the spectral decomposition of the coefficient matrix, results on the convergence of GMRES are derived.
منابع مشابه
On the Properties for Iteration of a Compact Operator with Unstructured Perturbation
We consider certain speed estimates for Krylov subspace methods (such as GMRES) when applied upon systems consisting of a compact operator K with small unstructured perturbation B. Information about the decay of singular values of K is also assumed. Our main result is that the Krylov method will perform initially at superlinear speed when applied upon such pre-conditioned system. However, with ...
متن کاملProperties of Iteration of Toeplitz Operators with Toeplitz
We consider the problems of preconditioning and iterative inversion of Toeplitz operators on sequences of complex numbers. We divide the preconditioned operator into two parts, of which one is compact and the other is regarded as a small perturbation. It will be shown that the Krylov subspace methods (such as GMRES) will perform initially at superlinear speed when applied to such preconditioned...
متن کاملSolving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملTikhonov regularization based on generalized Krylov subspace methods
We consider Tikhonov regularization of large linear discrete ill-posed problems with a regularization operator of general form and present an iterative scheme based on a generalized Krylov subspace method. This method simultaneously reduces both the matrix of the linear discrete ill-posed problem and the regularization operator. The reduced problem so obtained may be solved, e.g., with the aid ...
متن کامل